Path graph

Results: 1083



#Item
631Social Networks[removed]–96 The accuracy of small world chains in social networks Peter D. Killworth a,∗ , Christopher McCarty b , H. Russell Bernard c , Mark House b

Social Networks[removed]–96 The accuracy of small world chains in social networks Peter D. Killworth a,∗ , Christopher McCarty b , H. Russell Bernard c , Mark House b

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-11-19 02:38:46
632Earth Mover’s Distance based Similarity Search at Scale Yu Tang† , Leong Hou U‡ , Yilun Cai† , Nikos Mamoulis† , Reynold Cheng† † † {ytang,

Earth Mover’s Distance based Similarity Search at Scale Yu Tang† , Leong Hou U‡ , Yilun Cai† , Nikos Mamoulis† , Reynold Cheng† † † {ytang,

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-11-07 15:10:21
633Automatic versus Human Navigation in Information Networks Robert West and Jure Leskovec Computer Science Department Stanford University {west, jure}@cs.stanford.edu

Automatic versus Human Navigation in Information Networks Robert West and Jure Leskovec Computer Science Department Stanford University {west, jure}@cs.stanford.edu

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2013-09-11 13:44:52
634Simpler Linear-Time Modular Decomposition via Recursive Factorizing Permutations Marc Tedder1 , Derek Corneil1⋆ , Michel Habib2 , and Christophe Paul3⋆⋆ 1 Department of Computer Science, University of Toronto

Simpler Linear-Time Modular Decomposition via Recursive Factorizing Permutations Marc Tedder1 , Derek Corneil1⋆ , Michel Habib2 , and Christophe Paul3⋆⋆ 1 Department of Computer Science, University of Toronto

Add to Reading List

Source URL: www.cs.utoronto.ca

Language: English - Date: 2008-04-30 14:20:20
635arXiv:0803.4321v1 [cs.DM] 30 Mar[removed]How good is the Warnsdorff’s knight’s tour heuristic? Samuel L. Marateck Department of Computer Science, New York University,

arXiv:0803.4321v1 [cs.DM] 30 Mar[removed]How good is the Warnsdorff’s knight’s tour heuristic? Samuel L. Marateck Department of Computer Science, New York University,

Add to Reading List

Source URL: xxx.lanl.gov

Language: English - Date: 2011-08-05 19:30:18
636Scalable Influence Maximization in Social Networks under the Linear Threshold Model Wei Chen Microsoft Research Asia Beijing, China Email: [removed]

Scalable Influence Maximization in Social Networks under the Linear Threshold Model Wei Chen Microsoft Research Asia Beijing, China Email: [removed]

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-11-19 02:38:24
637Ranking of Closeness Centrality for Large-Scale Social Networks Kazuya Okamoto1 , Wei Chen2 , and Xiang-Yang Li3 1 Kyoto University, [removed]

Ranking of Closeness Centrality for Large-Scale Social Networks Kazuya Okamoto1 , Wei Chen2 , and Xiang-Yang Li3 1 Kyoto University, [removed]

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2009-07-21 19:43:34
638Exploiting Longer Cycles for Link Prediction in Signed Networks ∗ Kai-Yang Chiang UT Austin

Exploiting Longer Cycles for Link Prediction in Signed Networks ∗ Kai-Yang Chiang UT Austin

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2012-10-09 01:03:18
639Reverse Top-k Search using Random Walk with Restart † ∗ Adams Wei Yu†§ , Nikos Mamoulis§ , Hao Su‡

Reverse Top-k Search using Random Walk with Restart † ∗ Adams Wei Yu†§ , Nikos Mamoulis§ , Hao Su‡

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-12-06 16:23:06
640Graph Evolution: Densification and Shrinking Diameters JURE LESKOVEC Carnegie Mellon University JON KLEINBERG Cornell University

Graph Evolution: Densification and Shrinking Diameters JURE LESKOVEC Carnegie Mellon University JON KLEINBERG Cornell University

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-11-19 02:38:52